Region-Oriented Placement Algorithm for Coarse-Grained Power-Gating FPGA Architecture
نویسندگان
چکیده
منابع مشابه
Designing a Coarse-grained Reconfigurable Architecture for Power Efficiency∗
Coarse-grained reconfigurable architectures (CGRAs) have the potential to offer performance approaching an ASIC with the flexibility, within an application domain, similar to a digital signal processor. In the past, coarsegrained reconfigurable architectures have been encumbered by challenging programming models that are either too far removed from the hardware to offer reasonable performance o...
متن کاملQUKU: A Coarse Grained Paradigm for FPGA
To fill the gap between increasing demand for reconfigurability and performance efficiency, coarse grain reconfigurable architectures are seen to be an emerging platform. The advantage lies in quick dynamic reconfiguration and power efficiency. Despite having these advantages they have failed to show their mark. This paper describes the QUKU architecture, which uses a coarsegrained dynamically ...
متن کاملA Column Arrangement Algorithm for a Coarse-grained Reconfigurable Architecture
In a coarse-grained reconfigurable architecture, the functions of resources such as Arithmetic Logic Units (ALUs) can be reconfigured. Unlike the programmability of a general purpose processor, the programmability of a coarse-grained reconfigurable architecture is limited. The limitation might be the number of different patterns or the number of different configurations of each ALU. This paper ...
متن کاملCoarse Grained Reconfigurable Architecture
This paper examines the challenges of mapping applications on to a Coarsegrained reconfigurable architecture (CGRA). Through crowd sourcing through a simple game and using the movement data from successful players the research project plans to produce better mappings, or improve existing algorithms through common patterns by the most successful players. This paper also examines the case studies...
متن کاملHigh-Resolution Coarse-Grained Modeling Using Oriented Coarse-Grained Sites.
We introduce a method to bring nearly atomistic resolution to coarse-grained models, and we apply the method to proteins. Using a small number of coarse-grained sites (about one per eight atoms) but assigning an independent three-dimensional orientation to each site, we preferentially integrate out stiff degrees of freedom (bond lengths and angles, as well as dihedral angles in rings) that are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2012
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e95.d.314